Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain

The financial data supply chain is vital to the economy, especially for banks. It affects their customer service level, therefore, it crucial manage scheduling of elevate efficiency banking sectors’ performance. primary tool used in batch processing which requires efficient scheduling. This work investigates problem tasks with non-identical sizes and different priorities on a set parallel processors. An iterative dynamic algorithm (DCSDBP) was developed address batching process. objective minimize cost types while satisfying constraints such as resources availability, dependency relation. proved its effectiveness by allocating higher priority weight taking into consideration customers’ Service Level Agreement, time, costs, led lower total effective testing an illustrative network. Also, sensitivity analysis conducted varying model parameters networks complexities study impact under study.